github.com/andybalholm/brotli.hasherSearchResult.distance (field)

19 uses

	github.com/andybalholm/brotli (current package)
		backward_references.go#L75: 		sr.distance = 0
		backward_references.go#L90: 				sr2.distance = 0
		backward_references.go#L115: 				var distance_code uint = computeDistanceCode(sr.distance, max_distance+gap, dist_cache)
		backward_references.go#L116: 				if (sr.distance <= (max_distance + gap)) && distance_code > 0 {
		backward_references.go#L120: 					dist_cache[0] = int(sr.distance)
		backward_references.go#L136: 				if sr.distance < sr.len>>2 {
		backward_references.go#L137: 					range_start = brotli_min_size_t(range_end, brotli_max_size_t(range_start, position+sr.len-(sr.distance<<2)))
		h5.go#L160: 						out.distance = backward
		h5.go#L200: 						out.distance = backward
		h6.go#L162: 						out.distance = backward
		h6.go#L202: 						out.distance = backward
		hash.go#L40: 	distance       uint
		hash.go#L156: 	out.distance = backward
		hash_forgetful_chain.go#L197: 						out.distance = backward
		hash_forgetful_chain.go#L239: 						out.distance = backward
		hash_longest_match_quickly.go#L137: 					out.distance = cached_backward
		hash_longest_match_quickly.go#L172: 				out.distance = backward
		hash_longest_match_quickly.go#L201: 					out.distance = backward
		hash_rolling.go#L157: 							out.distance = backward